Partition Regular Systems of Linear Inequalities

ثبت نشده
چکیده

3 (m,p,c)-sets 59 4 Canonical Results 63 5 Coloring Objects of Higher Rank 65 1 Introduction In 1930 Ramsey published his paper On a problem in formal logic 12]. He established a result, nowadays known as Ramsey's Theorem: Let k and r be positive integers. Then for every r-coloring of the k-element subsets of ! there exists an innnite subset S ! such that all k-element subsets of S are colored the same. Already in 1927 van der Waerden published his theorem on arithmetic progressions 15]. He proved that for every coloring of the natural numbers with nitely many colors there exists a monochromatic arithmetic progression of given length. Van der Waerden's result can be seen in the context of Schur's investigations 14] on the distribution of quadratic residues and nonresidues. Schur knew about the existence of monochromatic solutions of x + y = z. He worked on such problems in order to resolve Fermat's conjecture, which was proved by Wiles in 1994. The above mentioned work of Ramsey 12] and van der Waerden 15] gave rise to the part of discrete mathematics, known as Ramsey Theory or Partition Theory. An important contribution was made by Rado 10] in 1933. Working on his dissertation, supervised by Schur, he was able to prove a common generalization of Schur's and van der Waerden's results by introducing the concept of regularity: A system of linear equations A~ x = ~ 0 is called regular over a ring R if it has monochromatic solutions for every coloring of R with nitely many colors. In his Studien zur Kombinatorik (1933) 10] Rado gave a complete characterization of all regular systems of linear equations over the rational numbers. The property Rado used in order to describe regular systems of linear equations is an syntactical property of the matrix. It is characterized by certain linear dependences of the columns of the matrix A and is called column property. It is possible to generalize the concept of regularity to systems of linear inequalities. We call a system of linear inequalities A~ x ~ 0 partition regular if for every coloring of the natural numbers with nitely many colors there exists a monochromatic solution of A~ x ~ 0. Rado considered systems of linear inequalities only incidentally. He stated the following proposition which is easy to prove: 2 Let the system P n j=1 a ij x j = …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

OPTIMIZATION OF LINEAR OBJECTIVE FUNCTION SUBJECT TO FUZZY RELATION INEQUALITIES CONSTRAINTS WITH MAX-AVERAGE COMPOSITION

In this paper, the finitely many constraints of a fuzzy relationinequalities problem are studied and the linear objective function on the regiondefined by a fuzzy max-average operator is optimized. A new simplificationtechnique which accelerates the resolution of the problem by removing thecomponents having no effect on the solution process is given together with analgorithm and a numerical exa...

متن کامل

Optimization of linear objective function subject to Fuzzy relation inequalities constraints with max-product composition

In this paper, we study the finitely many constraints of the fuzzyrelation inequality problem and optimize the linear objectivefunction on the region defined by the fuzzy max-product operator.Simplification operations have been given to accelerate theresolution of the problem by removing the components having noeffect on the solution process. Also, an algorithm and somenumerical and applied exa...

متن کامل

Linear optimization on Hamacher-fuzzy relational inequalities

In this paper, optimization of a linear objective function with fuzzy relational inequality constraints is investigated where the feasible region is formed as the intersection of two inequality fuzzy systems and Hamacher family of t-norms is considered as fuzzy composition. Hamacher family of t-norms is a parametric family of continuous strict t-norms, whose members are decreasing functions of ...

متن کامل

H∞ Filtering for Discrete-time Piecewise Linear Systems

This paper deals with the design of piecewise linear H∞ filters for discrete-time piecewise linear systems. Both the system and filter have structures that change according to their switching rules. The system switching rule is characterized in terms of a given partition of the system state-space. The filter switching rule is also characterized in terms of a suitable filter state-space partitio...

متن کامل

Partition Analysis, Modular Functions, and Computer Algebra

This article describes recent developments connecting problems of enumerative combinatorics, constrained by linear systems of Diophantine inequalities, with number theory topics like partitions, partition congruences, and q-series identities. Special emphasis is put on the role of computer algebra algorithms. The presentation is intended for a broader audience; to this end, elementary introduct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996